Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration
نویسندگان
چکیده
منابع مشابه
Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration
We study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting of process algebra. To represent the infinite behavior, we consider the prefix iteration extension of a fragment of Milner’s CCS. The prefix iteration operator is a variant on the binary version of the Kleene star operator obtained by restricting the first argument to be an atomic action and allows us to ...
متن کاملA Complete Equational Axiomatization for Prefix Iteration
Prefix iteration a∗x is added to Minimal Process Algebra (MPAδ), which is a subalgebra of BPAδ equivalent to Milner’s basic CCS. We present a finite equational axiomatization for MPA∗ δ , and prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we set up a term rewriting system, based on the axioms, and show that bisimilar terms have...
متن کاملA Complete Axiomatization for Prefix Iteration in Branching Bisimulation
This paper studies the interaction of prefix iteration with the silent step in the setting of branching bisimulation. We present a finite equational axiomatization for Basic Process Algebra with deadlock, empty process and the silent step, extended with prefix iteration, and prove that this axiomatization is complete with respect to rooted branching bisimulation equivalence.
متن کاملOn the Complete Axiomatization for Prefix Iteration modulo Observation Congruence
Prefix iteration is a variation on the original binary version of the Kleene star operation P ∗Q, obtained by restricting the first argument to be an atomic action. Aceto and Ingólfsdóttir provided an axiom system for observation congruence over basic CCS with prefix iteration. However hitherto the only direct completeness proof given for such a system is very long and technical. In this paper,...
متن کاملA Complete Finite Prefix for Process Algebra
In this paper we show how to use McMillan’s complete finite prefix approach for process algebra. We present the model of component event structures as a semantics for process algebra, and show how to construct a complete finite prefix for this model. We present a simple adequate order (using an order on process algebra expressions) as an optimization to McMillan’s original algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.04.053